Construction of Indecomposable Heronian Triangles
نویسندگان
چکیده
منابع مشابه
Heronian Triangles Whose Areas Are Integer Multiples of Their Perimeters
We present an improved algorithm for finding all solutions to Goehl’s problem A = mP for triangles, i.e., the problem of finding all Heronian triangles whose area (A) is an integer multiple (m) of the perimeter (P ). The new algorithm does not involve elimination of extraneous rational triangles, and is a true extension of Goehl’s original method.
متن کاملPrimitive Heronian Triangles With Integer Inradius and Exradii
It is well known that primitive Pythagorean triangles have integer inradius and exradii. We investigate the generalization to primitive Heronian triangles. In particular, we study the special cases of isosceles triangles and triangles with sides in arithmetic progression. We also give two families of primitive Heronian triangles, one decomposable and one indecomposable, which have integer inrad...
متن کاملConstruction of 3D Triangles on Dupin Cyclides
This paper considers the conversion of the parametric Bézier surfaces, classically used in CAD-CAM, into patched of a class of non-spherical degree 4 algebraic surfaces called Dupin cyclides, and the definition of 3D triangle with circular edges on Dupin cyclides. Dupin cyclides was discovered by the French mathematician Pierre-Charles Dupin at the beginning of the 19th century. A Dupin cyclide...
متن کاملHeronian Tetrahedra Are Lattice Tetrahedra
Extending a similar result about triangles, we show that each Heronian tetrahedron may be positioned with integer coordinates. More generally, we show the following: if an integral distance set in R can be positioned with rational coordinates, then it can in fact be positioned with integer coordinates. The proof, which uses the arithmetic of quaternions, is tantamount to an algorithm.
متن کاملConstruction of a VC1 interpolant over triangles via edge deletion
We present a construction of a visually smooth surface which interpolates to position values and normal vectors of randomly distributed points on a 3D object. The method is local and uses quartic triangular and bicubic quadrilateral patches without splits. It heavily relies on an edge deleting algorithm which, starting from a given triangulation, derives a suitable combination of threeand four ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rocky Mountain Journal of Mathematics
سال: 1998
ISSN: 0035-7596
DOI: 10.1216/rmjm/1181071762